On semigroups with PSPACE-complete subpower membership problem
نویسنده
چکیده
Fix a finite semigroup S and let a1, . . . , ak , b be tuples in a direct power S. The subpower membership problem (SMP) for S asks whether b can be generated by a1, . . . , ak. For combinatorial Rees matrix semigroups we establish a dichotomy result: if the corresponding matrix is of a certain form, then the SMP is in P; otherwise it is NP-complete. For combinatorial Rees matrix semigroups with adjoined identity, we obtain a trichotomy: the SMP is either in P, NP-complete, or PSPACE-complete. This result yields various semigroups with PSPACE-complete SMP including the 6-element Brandt monoid, the full transformation semigroup on 3 or more letters, and semigroups of all n by n matrices over a field for n ≥ 2.
منابع مشابه
The subpower membership problem for semigroups
Fix a finite semigroup S and let a1, . . . , ak , b be tuples in a direct power S. The subpower membership problem (SMP) asks whether b can be generated by a1, . . . , ak. If S is a finite group, then there is a folklore algorithm that decides this problem in time polynomial in nk. For semigroups this problem always lies in PSPACE. We show that the SMP for a full transformation semigroup on 3 o...
متن کاملGraph Isomorphism is PSPACE-complete
Combining the the results of A.R. Meyer and L.J. Stockmeyer " The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space " , and K.S. Booth " Iso-morphism testing for graphs, semigroups, and finite automata are polynomiamlly equivalent problems " shows that graph isomorphism is PSPACE-complete. The equivalence problem for regular expressions was shown to be PSPACE-...
متن کاملThe Subpower Membership Problem for Mal'cEV Algebras
Given tuples a1, . . . , ak and b in A n for some algebraic structure A, the subpower membership problem asks whether b is in the subalgebra of An that is generated by a1, . . . , ak . For A a finite group, there is a folklore algorithm which decides this problem in time polynomial in n and k. We show that the subpower membership problem for any finite Mal’cev algebra is in NP and give a polyno...
متن کاملOn the Complexity of the Word Problem of Automaton Semigroups and Automaton Groups
In this paper, we study the word problem of automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and, thus, an automaton semigroup with a PSpace...
متن کاملThe Subpower Membership Problem for Finite Algebras with Cube Terms
The subalgebra membership problem is the problem of deciding if a given element belongs to an algebra given by a set of generators. This is one of the best established computational problems in algebra. We consider a variant of this problem, which is motivated by recent progress in the Constraint Satisfaction Problem, and is often referred to as the Subpower Membership Problem (SMP). In the SMP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1604.01757 شماره
صفحات -
تاریخ انتشار 2016